Pushing Extrema Aggregates to Optimize Logic Queries ? Sergio Greco
نویسنده
چکیده
In this paper, we explore the possibility of transforming queries with minimum and maximum predicates into equivalent queries that can be computed more efficiently. The main contribution of the paper is an algorithm for propagating min and max predicates while preserving query equivalence under certain monotonicity constraints. We show that the algorithm is correct and that the transformed query is often safe when the original one is not. Although in this paper we use logic rules, the technique presented can be used to optimize (possibly recursive) queries expressed by means of SQL3.
منابع مشابه
Pushing extrema aggregates to optimize logic queries
In this paper, we explore the possibility of transforming queries with minimum and maximum predicates into equivalent queries that can be computed more efficiently. The main contribution of the paper is an algorithm for propagating min and max predicates while preserving query equivalence under certain monotonicity constraints. We show that the algorithm is correct and that the transformed quer...
متن کاملOptimization of Logic Queries ? with MIN
We propose an algorithm for pushing min and max aggregates into recursive predicates, while preserving query equivalence under certain monotonicity constraints. The transformed query is often safe when the original one is not, and more eecient than the original query when this is safe.
متن کاملThe Magic of Pushing Extrema into Recursion: Simple, Powerful Datalog Programs
We introduce a novel query optimization method based on pushing extrema and other integrity constraints into recursion. This optimization produces an efficient operational semantics for the goals declaratively specified by the original program that is stratified with respect to negation and aggregates. Complex algorithms can now be specified via simpler programs, and then implemented via optimi...
متن کاملThe PushDown Method to Optimize Chain Logic Programs (Extended Abstract)
The critical problem of finding efficient implementations for recursive queries with bound arguments offers many open challenges of practical and theoretical import. We propose a novel approach that solves this problem for chain queries, i.e., for queries where bindings are propagated from arguments in the head to arguments in the tail of the rules, in a chain-like fashion. The method, called p...
متن کاملDatalog and Logic Databases
In relational databases, datalog is an important attribute which helps to develop declarative queries. It is certainly the prolog that contributes this non procedural language. Datalog offers more than query languages with its recursion feature. Realizing its potential the authors in the book on Datalog and Logic Databases have presented a logical flow of datalog and logical databases with the ...
متن کامل